#include <iostream>
template <typename T>//110-12-16=82
struct binary_tree
{
    T data;
    binary_tree* left;
    binary_tree* right;
    
    // 构造函数
    binary_tree(const T& value): data(value), left(nullptr), right(nullptr){}
    binary_tree(const T& value,binary_tree* l,binary_tree* r):data(value),left(l),right(r){}
};
int main()
{
    binary_tree<char> test('R',
        new binary_tree<char>('A',nullptr,
            new binary_tree<char>('D',
                new binary_tree<char>('I'),nullptr)),//左边
        new binary_tree<char>('B',
            new binary_tree<char>('E',
                new binary_tree<char>('K'),nullptr),
                    new binary_tree<char>('F'))//右边
    
    );
     
    return 0;
}